Adaptive and Compact Discretization for Weighted Region Optimal Path Finding
نویسندگان
چکیده
This paper presents several results on the weighted region optimal path problem. An often-used approach to approximately solve this problem is to apply a discrete search algorithm to a graph G2 generated by a discretization of the problem; this graph guarantees to contain an 2-approximation of an optimal path between given source and destination points. We first provide a discretization scheme such that the size of G2 does not depend on the ratio between the maximum and minimum unit weights. This leads to the first 2-approximation algorithm whose complexity is not dependent on the unit weight ratio. We also introduce an empirical method, called adaptive discretization method, that improves the performance of the approximation algorithms by placing discretization points densely only in areas that may contain optimal paths. BUSHWHACK is a discrete search algorithm used for finding optimal paths in G2. We added two heuristics to BUSHWHACK to improve its performance
منابع مشابه
Weighted Optimal Path in Graph with Multiple Indexes
This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment ...
متن کاملAn E cient Approximation Algorithm for Weighted Region Shortest Path
In this paper we present an approximation algorithm for solving the following optimal motion planning problem: Given a planar space composed of triangular regions , each of which is associated with a positive unit weight, and two points s and t, nd a path from s to t with the minimum weight, where the weight of a path is deened to be the weighted sum of the lengths of the sub-paths within each ...
متن کاملA polynomial time algorithm for finding an approximate shortest path amid weighted regions
We devise a polynomial-time approximation scheme for the classical geometric problem of finding an ǫ-short path amid weighted regions. In this problem, a triangulated region P comprising of n triangles, a positive weight associated with each triangle, and two points s and t that belong to P are given as the input. The objective is to find a path whose cost is at most (1+ ǫ)OPT where OPT is the ...
متن کاملThe Weighted Region Problem Is Defined as the Problem of Finding a Cost-optimal Path in a Weighted Planar Polygonal Subdivision. Searching for Paths on a Grid Representation Constr. Time
finding a cost-optimal path in a weighted planar polygonal subdivision. Searching for paths on a grid representation of the scene is fast and easy to implement. However, grid representations do not capture the exact geometry of the scene. Hence, grid paths can be inaccurate or might not even exist at all. Methods that work on an exact representation of the scene can approximate an optimal path ...
متن کاملFinding Optimal-Path Maps for Path Planning across Weighted Regions
Optimal-path maps tell robots or people the best way to reach a goal point from anywhere in a known terrain area, eliminating most of the need to plan during travel. The authors address the construction of optimal-path maps for two-dimensional polygonal weighted-region terrain, terrain partitioned into polygonal areas such that the cost per unit of distance traveled is homogeneous and isotropic...
متن کامل